Spherically complete models of Hensel minimal valued fields
نویسندگان
چکیده
We prove that Hensel minimal expansions of finitely ramified Henselian valued fields admit spherically complete immediate elementary extensions. More precisely, the version minimality we use is 0-hmix-minimality (which, in equi-characteristic 0, amounts to 0-h-minimality).
منابع مشابه
Dp-Minimal Valued Fields
We show that dp-minimal valued fields are henselian and give classifications of dp-minimal ordered abelian groups and dp-minimal ordered fields without additional structure.
متن کاملA Model Complete Theory of Valued D-Fields
The notion of a D-ring, generalizing that of a differential or a difference ring, is introduced. Quantifier elimination and a version of the AxKochen-Ershov principle is proven for a theory of valued D-fields of residual characteristic zero. The model theory of differential and difference fields has been extensively studied (see for example [7, 3]) and valued fields have proven to be amenable t...
متن کاملPERIOD-INDEX AND u-INVARIANT QUESTIONS FOR FUNCTION FIELDS OVER COMPLETE DISCRETELY VALUED FIELDS
Let K be a complete discretely valued field with residue field κ and F the function field of a curve over K. Let p be the characteristic of κ and l a prime not equal to p. If the Brauer l-dimensions of all finite extensions of κ are bounded by d and the Brauer l-dimensions of all extensions of κ of transcendence degree at most 1 are bounded by d + 1, then it is known that the Brauer l-dimension...
متن کاملFUZZY HYPERVECTOR SPACES OVER VALUED FIELDS
In this note we first redefine the notion of a fuzzy hypervectorspace (see [1]) and then introduce some further concepts of fuzzy hypervectorspaces, such as fuzzy convex and balance fuzzy subsets in fuzzy hypervectorspaces over valued fields. Finally, we briefly discuss on the convex (balanced)hull of a given fuzzy set of a hypervector space.
متن کاملHensel lifting and bivariate polynomial factorisation over finite fields
This paper presents an average time analysis of a Hensel lifting based factorisation algorithm for bivariate polynomials over finite fields. It is shown that the average running time is almost linear in the input size. This explains why the Hensel lifting technique is fast in practice for most polynomials.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Logic Quarterly
سال: 2023
ISSN: ['0942-5616', '1521-3870']
DOI: https://doi.org/10.1002/malq.202100055